1 The Economic Lot Scheduling Problem
نویسنده
چکیده
Economies of scale often dictate the choice of a single high speed machine capable of producing a given set of items over the choice of one dedicated machine for each item in the set. A scheduling problem arises when the high speed machine can only produce one item at a time. The problem is further complicated when the machine needs to be setup (often at a cost of both time and money) before a different item can be produced. The Economic Lot Scheduling Problem (ELSP) is that of scheduling the production of a set of items in a single machine to minimizing the long run average holding and set up cost under the assumptions of known constant demand and production rates. Unfortunately, the ELSP belongs to a class of problems, known as NP-hard, see Gallego and Shaw [3], for which it is unlikely that an efficient solution procedure would ever be developed. What makes the ELSP hard is the coordination problem that needs to be resolved among the items competing for the machine capacity. Thus, much of the research effort on the ELSP (over 40 published papers) has dealt with the problem of finding low cost schedules via heuristics. Fortunately, good heuristics have been developed to obtain feasible production schedules whose average cost is often (but not guaranteed to be) close to the optimal. See Dobson [1]. Recently the research focus has shifted to deal with the more practical issues of real time scheduling, setup time reduction and the cost of offering variety. We will start by presenting a lower bound on the long run average cost. This bound will be later used to assess the performance of the rotation schedule (RS) heuristic which calls for setting up and producing the items once per cycle in a given order. Our next goal is to discuss issues that arise in trying to implement feasible ELSP schedules. Our third goal is concerned with a brief discussion of the cost of offering variety and the effect of reducing setup times. The data for the problem are:
منابع مشابه
The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups
The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic me...
متن کاملFinite Horizon Economic Lot and Delivery Scheduling Problem: Flexible Flow Lines with Unrelated Parallel Machines and Sequence Dependent Setups
This paper considers the economic lot and delivery scheduling problem in a two-echelon supply chains, where a single supplier produces multiple components on a flexible flow line (FFL) and delivers them directly to an assembly facility (AF). The objective is to determine a cyclic schedule that minimizes the sum of transportation, setup and inventory holding costs per unit time without shortage....
متن کاملThe Finite Horizon Economic Lot Scheduling in Flexible Flow Lines
This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...
متن کاملA Basic Period Approach for Solving the Economic Lot and Delivery Scheduling in Flexible Flow Lines
In this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. Single supplier via a flexible flow line production system (FFL), produces several items and delivers them directly to an assembly facility. Based on basic period (BP) strategy, a new mixed zero-one nonlinear programming model has been develop...
متن کاملEconomic Lot Sizing and Scheduling in Distributed Permutation Flow Shops
This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...
متن کاملOptimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time
In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...
متن کامل